package com.squirrel.michale;

/**
 * @author guanhao 观浩
 * @version 1.0.0.0
 * @createTime 2023/2/27 8:23 PM
 * @company Michale Squirrel
 * @link
 * @description
 */
public class LeetCode2359 {

    public int maximumGroups(int[] grades) {
        int n = grades.length;
        int ans = 0, cm = 1;
        while (n >= cm){
            ans++;
            n-=cm;
            cm++;
        }
        return ans;
    }
}
